Cipher implementation

ABSTRACT

In some embodiments of the present invention, a method and apparatus to perform at least one of a confidentiality algorithm and an integrity algorithm comprising an output from a partial KASUMI block cipher.

BACKGROUND OF THE INVENTION

[0001] Confidentiality and integrity algorithms for encryption/decryption of telecommunication transmission and reception may be defined in standards, such as but not limited to, “3GPP TS 35.201 V4.1.0 (2001-12)” —3rd Generation Partnership Project (3GPP), Technical Specification Group Services and System Aspects, 3G Security, Specification of the 3GPP Confidentiality and Integrity Algorithms, Document 1: f8 and f9 Specification”. The document is publicly available from the 3GPP website http://www. 3gpp. org.

[0002] Within the security architecture of the 3GPP system, there may be two standardized algorithms: a confidentiality algorithm f8, and an integrity algorithm f9. These algorithms (also referred to as functions, the terms being used interchangeably) may be based on the so-called KASUMI algorithm (also referred to as simply KASUMI), a block cipher that may produce a 64-bit output from a 64-bit input under the control of a 128-bit key.

[0003] The confidentiality algorithm f8 may be a stream cipher used to encrypt or decrypt blocks of data under a confidentiality key CK. The block of data may be between 1 and 20000 bits long, for example. The f8 algorithm may use KASUMI in a form of output-feedback mode as a keystream generator.

[0004] The integrity algorithm f9 may compute a 32-bit MAC (Message Authentication Code) of a given input message using an integrity key IK.

[0005] In the 3GPP standard, the length of the message for use with the f8 and f9 algorithms may vary from 64 bits to 5120 bits. The message may be divided into blocks of 64 bits. The largest message may thus comprise 80 blocks (80×64=5120). In the 3GPP standard, the implementation of the f8 and f9 algorithms for 80 blocks may comprise 81 KASUMI modules. There may be 16,000 (16K) gates for one KASUMI module. Accordingly, there may be 81×16K=1296K gates for the implementation of the f8 and f9 algorithms. This may be disadvantageously large in terms of chip size in various telecommunications systems, such as but not limited to, WCDMA (wideband code division multiple access) chipsets.

BRIEF DESCRIPTION OF THE DRAWINGS

[0006] The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with objects, features and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanied drawings in which:

[0007]FIG. 1 is a simplified illustration of apparatus for generating a keystream for performing a confidentiality function, which may form part of a communications system, in accordance with an embodiment of the invention;

[0008]FIG. 2 is a simplified block diagram of a partial KASUMI block cipher, in accordance with an embodiment of the invention;

[0009]FIG. 3 is a simplified block diagram of a first subfunction;

[0010]FIG. 4 is a simplified block diagram of a second subfunction;

[0011]FIG. 5 is a simplified block diagram of a third subfunction;

[0012]FIG. 6 is a simplified illustration of apparatus for performing an integrity function, which may form part of a communications system, in accordance with an embodiment of the invention; and

[0013]FIG. 7 is a simplified general flow chart for performing a confidentiality algorithm and an integrity algorithm with a partial KASUMI block cipher, in accordance with an embodiment of the invention.

[0014] It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals may be repeated among the figures to indicate corresponding or analogous elements.

DETAILED DESCRIPTION OF THE INVENTION

[0015] In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the invention. However it will be understood by those of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the present invention.

[0016] Some portions of the detailed description that follows are presented in terms of algorithms and symbolic representations of operations on data bits or binary digital signals within a computer memory. These algorithmic descriptions and representations may be the techniques used by those skilled in the data processing arts to convey the substance of their work to others skilled in the art.

[0017] Reference is now made to FIG. 1, which illustrates apparatus for generating a keystream, in accordance with an embodiment of the invention. The keystream generator of FIG. 1 may comprise a partial KASUMI block cipher 12, as opposed to a full KASUMI block cipher. As described in detail further hereinbelow, partial KASUMI block cipher 12 may be used to generate at least one of a keystream and a message authentication code, without necessarily utilizing the full KASUMI block cipher. (For example, the keystream and/or message authentication code may be generated solely with the partial KASUMI block cipher or optionally in part with the partial KASUMI block cipher and in part with a full KASUMI block cipher.) In order to better understand the partial KASUMI block cipher 12, the full KASUMI block cipher will be described with reference to FIG. 2.

[0018] The apparatus of FIG. 1 may form part of a communications system, such as but not limited to, a code division multiple access (CDMA) or WCDMA receiver or communications system, GSM (Global System for Mobile Communication), EDGE (Enhanced Data Rates For Global Evolution), UMTS (Universal Mobile Telecommunication System), UTRAN (UMTS Terrestrial Radio Access Network) and FOMA (Freedom Of Mobile Multimedia Access), which may comprise communications components, such as but not limited to, a transceiver 17 which may communicate data between the partial KASUMI block cipher 12 and a cellular telephone system 19, e.g., via an antenna 15. Antenna 15 may be suitable for supporting communication in any of the abovementioned communication systems. A storage medium 21, such as but not limited to, a floppy disk, compact disc, hard drive, or volatile or non-volatile memory array, may be provided for storing instructions that enable a processor 23 to perform a confidentiality algorithm and/or an integrity algorithm comprising an output from the partial KASUMI block cipher 12, as described more in detail hereinbelow. Processor 23 may comprise, without limitation, components enclosed in a dashed box in FIG. 1, as described further hereinbelow. However, it is to be emphasized that processor 23 is not limited to the components shown in FIG. 1, and may comprise other components other than those shown in FIG. 1.

[0019] Reference is now made to FIG. 2, which illustrates a full KASUMI block cipher 14 and the partial KASUMI block cipher 12. The full KASUMI block cipher 14 and the partial KASUMI block cipher 12 may comprise a number of subfunctions OF, FI and FL (described hereinbelow with reference to FIGS. 3, 4 and 5, respectively), used in conjunction with associated sub-keys (KL, KO, KI) in a Feistel structure comprising a number of rounds (and rounds within rounds for some subfunctions).

[0020] The full KASUMI block cipher 14 may operate on a 64-bit input I using a 128-bit key K to produce a 64-bit output OUTPUT, as follows:

[0021] The input I may be divided into two 32-bit strings L₀ and R₀, wherein

I=L₀∥R₀

[0022] For each integer i with 1≦i≦8:

[0023] R_(i)=L_(i-1), L_(i)=R_(i-1)⊕f_(i)(L_(i-1), RK_(i))

[0024] wherein

[0025] i=the i^(th) round function of KASUMI,

[0026] f_(i)=the round function with L_(i-1), and round key RK_(i) as inputs.

[0027] The result OUTPUT equals the 64-bit string (L₈∥R₈) offered at the end of the eighth round.

[0028] ⊕ represents the bitwise exclusive-OR (XOR) operation, and ∥ represents the concatenation of two operands.)

[0029] The function f_(i) may take a 32-bit input I and return a 32-bit output 0 under the control of a round key RK_(i), where the round key may comprise the subkey triplet of (KL_(i), KO_(i), KI_(i)). The function f_(i) may be constructed from two subfunctions; FL and FO with associated subkeys KL_(i) (used with FL) and subkeys KO_(i) and KI_(i) (used with FO).

[0030] The f_(i) function may have two different forms as follows:

[0031] For rounds 1, 3, 5 and 7:

[0032] f_(i)(I,RK_(i))=FO(FL(I, KL_(i)), KO_(i), KI_(i))

[0033] For rounds 2, 4, 6 and 8:

[0034] f_(i)(I,K_(i))=FL(FO(I, KO_(i), KI_(i)), KL_(i))

[0035] Accordingly, for oddrounds the round data may be passed through FL( ) and then FO( ), while for even rounds it may be passed through FO( ) and then FL( ).

[0036] Reference is now made to FIG. 3, which illustrates the function FO. The input to the function FO may comprise a 32-bit data input I and two sets of subkeys, a 48-bit subkey KO_(i) and 48-bit subkey KI_(i).

[0037] The 32-bit data input may be split into two halves, L₀ and R₀ wherein

I=L₀∥R₀.

[0038] The 48-bit subkeys may be subdivided into three 16-bit subkeys wherein

KO_(i)=KO_(i,1)∥KO_(i,2)∥KO_(i,3) and KI_(i)=KI_(i,1)∥KI_(i,2)∥KI_(i,3).

[0039] For each integer j with 1≦j≦3:

R_(j)=FI(L_(j-1)⊕KO_(ij), KI_(ij))⊕R_(j-1)

L_(j)=R_(j-1)

[0040] which may return the 32-bit value (L₃∥R₃).

[0041] Reference is now made to FIG. 4, which illustrates the function FI. The thick and thin lines in FIG. 4 may be used to emphasize the difference between 9-bit and 7-bit data paths, respectively.

[0042] The function FI may take a 16-bit data input I and 16-bit subkey KI_(ij). The input I may be split into two unequal components, a 9-bit left half L₀ and a 7-bit right half R₀ where I=L₀∥R₀.

[0043] Similarly the key KI_(ij) may be split into a 7-bit component KI_(ij,1), and a 9-bit component KI_(ij,2) where KI_(ij)=KI_(ij,1)∥KI_(ij,2).

[0044] The function FI may use two S-boxes, S7 which maps a 7-bit input to a 7-bit output, and S9 which maps a 9-bit input to a 9-bit output. The two S-boxes are defined further hereinbelow. The function FI may also use two additional functions, designated ZE( ) and TR( ), defined as follows:

[0045] ZE(x) may take the 7-bit value x and convert it to a 9-bit value by adding two zero bits to the most-significant end.

[0046] TR(x) may take the 9-bit value x and convert it to a 7-bit value by discarding the two most-significant bits.

[0047] The following series of operations may be defined:

L₁=R₀ R₁=S9[L₀]⊕ZE(R₀)

L₂=R₁⊕KI_(ij,2) R₂=S7[L₁]⊕TR(R₁)⊕KI_(ij,1)

L₃=R₂ R₃=S9[L₂]⊕ZE(R₂)

L₄=S7[L₃]⊕TR(R₃) R₄=R₃

[0048] The function FI may return the 16-bit value (L₄∥R₄).

[0049] The two S-boxes mentioned above may be implemented in combinational logic as well as by a look-up table. For the two S-boxes, the input x comprises either seven or nine bits with a corresponding number of bits in the output y, wherein:

x=x8∥x7∥x6∥x5∥x4∥x3∥1x2∥x1∥x0

and

y=y8∥y7∥y6∥y5∥y4∥y3∥y2∥y1∥y0

[0050] wherein the x8, y8 and x7,y7 bits may only apply to S9, and the x0 and y0 bits may be the least significant bits.

[0051] In the logic equations:

[0052] x0x1x2 implies x0

x1

x2 where

is the AND operator.

[0053] Gate Logic for S7:

[0054] y0=x1x3⊕x4⊕x0x1x4⊕x5⊕x2x5⊕x3x4x5⊕x6⊕x0x6⊕x1x6⊕x3x6⊕x2x4x6⊕x1x5x6 ⊕x4x5x6

[0055] y1=x0x1⊕x0x4⊕x2x4⊕x5⊕x1x2x5⊕x0x3x5⊕x6⊕x0x2x6⊕x3x6⊕x4x5x6⊕1

[0056] y2=x0⊕x0x3⊕x2x3⊕x1x2x4⊕x0x3x4⊕x1x5⊕x0x2x5⊕x0x6⊕x0x1x6⊕x2x6⊕x4x6⊕1

[0057] y3=x1⊕x0x1x2⊕x1x4⊕x3x4⊕x0x5⊕x0x1x5⊕x2x3x5⊕x1x4x5⊕3x2x6⊕x1x3x6

[0058] y4=x0x2⊕x3⊕x1x3⊕x1x4⊕x0x1x4⊕x2x3x4⊕x0x5⊕x1x3x5⊕x0x4x5⊕x1x6⊕x3x6⊕x0x3x6⊕x5x6⊕1

[0059] y5=x2⊕x0x2⊕x0x3⊕x1x2x3⊕x0x2x4⊕x0x5⊕x2x5⊕x4x5⊕x1x6⊕x1x2x6⊕x0x3x6

[0060] ⊕x3x4x6⊕x2x5x6⊕1

[0061] y6=x1x2⊕x0x1x3⊕x0x4⊕x1x5⊕x3x5⊕x6⊕x0x1x6⊕x2x3x6⊕x1x4x6⊕x0x5x6

[0062] Decimal Table:

[0063]54, 50, 62, 56, 22, 34, 94, 96, 38, 6, 63, 93, 2, 18,123, 33,

[0064]55,113, 39,114, 21, 67, 65, 12, 47, 73, 46, 27, 25,111,124, 81,

[0065]53, 9,121, 79, 52, 60, 58, 48,101,127, 40,120,104, 70, 71, 43,

[0066]20,122, 72, 61, 23,109, 13,100, 77, 1, 16, 7, 82, 10,105, 98,

[0067]117,116, 76, 11, 89,106, 0,125,118, 99, 86, 69, 30, 57,126, 87,

[0068]112, 51, 17, 5, 95, 14, 90, 84, 91, 8, 35,103, 32, 97,28, 66,

[0069]102, 31, 26, 45, 75, 4, 85, 92, 37, 74, 80, 49, 68, 29,115, 44,

[0070]64,107,108, 24,110, 83, 36, 78, 42, 19, 15, 41, 88,119, 59, 3

[0071] Gate Logic for S9:

[0072] y0=x0x2⊕x3⊕x2x5⊕x5x6⊕x0x7⊕x1x7⊕x2x7⊕x4x8⊕x5x8⊕x7x8⊕1

[0073] y1=x1⊕x0x1⊕x2x3⊕x0x4⊕x1x4⊕x0x5⊕x3x5⊕x6⊕x1x7⊕x2x7⊕x5x8⊕1

[0074] y2=x1⊕1x0x3⊕x3x4⊕x0x5⊕x2x6⊕x3x6⊕x5x6⊕x4x7⊕x5x7⊕x6x7⊕x8⊕x0x8⊕1

[0075] y3=x0⊕x1x2⊕x0x3⊕x2x4⊕x5⊕x0x6⊕x1x6⊕x4x7⊕x0x8⊕x1x8⊕x7x8

[0076] y4=x0x1⊕x1x3⊕x4⊕x0x5⊕x3x6⊕x0x7⊕x6x7⊕x1x8⊕x2x8⊕x3x8

[0077] y5=x2⊕x1x4⊕x4x5⊕x0x6⊕x1x6⊕x3x7⊕x4x7⊕x6x7⊕x5x8⊕x6x8⊕x7x8⊕1

[0078] y6=x0⊕x2x3⊕x1x5⊕x2x5⊕x4x5⊕x3x6⊕x4x6⊕x5x6⊕x7⊕x1x8⊕x3x8⊕x5x8⊕x7x8

[0079] y7=x0x1⊕x0x2⊕x1x2⊕x3⊕x0x3⊕x2x3⊕x4x5⊕x2x6⊕x3x6⊕x2x7⊕x5x7⊕x8⊕1

[0080] y8=x0x1⊕x2⊕x1x2⊕x3x4⊕x1x5⊕x2x5⊕x1x6⊕x4x6⊕x7⊕x2x8⊕x3x8

[0081] Decimal Table:

[0082]167,239,161,379,391,334, 9,338, 38,226, 48,358,452,385, 90,397,

[0083]183,253,147,331,415,340, 51,362,306,500,262, 82,216,159,356,177,

[0084]175,241,489, 37,206, 17, 0,333, 44,254,378, 58,143,220, 81,400,

[0085]95, 3,315,245, 54,235,218,405,472,264,172,494,371,290,399, 76,

[0086]165,197,395,121,257,480,423,212,240, 28,462,176,406,507,288,223,

[0087]501,407,249,265, 89,186,221,428,164, 74,440,196,458,421,350,163,

[0088]232,158,134,354, 13,250,491,142,191, 69,193,425,152,227,366,135,

[0089]344,300,276,242,437,320,113,278, 11,243, 87,317, 36, 93,496, 27,

[0090]487,446,482, 41, 68,156,457,131,326,403,339, 20, 39,115,442,124,

[0091]475,384,508, 53,112,170,479,151,126,169, 73,268,279,321,168,364,

[0092]363,292, 46,499,393,327,324, 24,456,267,157,460,488,426,309,229,

[0093]439,506,208,271,349,401,434,236, 16,209,359, 52, 56,120,199,277,

[0094]465,416,252,287,246, 6, 83,305,420,345,153,502, 65, 61,244,282,

[0095]173,222,418, 67,386,368,261,101,476,291,195,430, 49, 79,166,330,

[0096]280,383,373,128,382,408,155,495,367,388,274,107,459,417, 62,454,

[0097]132,225,203,316,234, 14,301, 91,503,286,424,211,347,307,140,374,

[0098]35,103,125,427, 19,214,453,146,498,314,444,230,256,329,198,285,

[0099]50,116, 78,410, 10,205,510,171,231, 45,139,467, 29, 86,505, 32,

[0100]72, 26,342,150,313,490,431,238,411,325,149,473, 40,119,174,355,

[0101]185,233,389, 71,448,273,372, 55,110,178,322, 12,469,392,369,190,

[0102]1,109,375,137,181, 88, 75,308,260,484, 98,272,370,275,412,111,

[0103]336,318, 4,504,492,259,304, 77,337,435, 21,357,303,332,483, 18,

[0104]47, 85, 25,497,474,289,100,269,296,478,270,106, 31,104,433, 84,

[0105]414,486,394, 96, 99,154,511,148,413,361,409,255,162,215,302,201,

[0106]266,351,343,144,441,365,108,298,251, 34,182,509,138,210,335,133,

[0107]311,352,328,141,396,346,123,319,450,281,429,228,443,481, 92,404,

[0108]485,422,248,297, 23,213,130,466, 22,217,283, 70,294,360,419,127,

[0109]312,377, 7,468,194, 2,117,295,463,258,224,447,247,187, 80,398,

[0110]284,353,105,390,299,471,470,184, 57,200,348, 63,204,188, 33,451,

[0111]97, 30,310,219, 94,160,129,493, 64,179,263,102,189,207,114,402,

[0112]438,477,387,122,192, 42,381, 5,145,118,180,449,293,323,136,380,

[0113]43, 66, 60,455,341,445,202,432, 8,237, 15,376,436,464, 59,461

[0114] Reference is flow made to FIG. 5, which illustrates the function FL. The input to the function FL may comprise a 32-bit data input I and a 32-bit subkey KL_(i). The subkey may be split into two 16-bit subkeys, KL_(i,1) and KL_(i,2) wherein

KL_(i)=KL_(i,1)∥KL_(i,2).

[0115] The input data I may be split into two 16-bit halves, L and R where I=L∥R.

R′=R⊕+ROL(L

KL_(i,1))

L′=L⊕+ROL(R′∪KL_(i,2))

[0116] wherein the 32-bit output value=(L′∥R′), and wherein ROL is the left circular rotation of the operand by one bit.

[0117] In one embodiment of the invention, the partial KASUMI block cipher 12 may comprise a one-quarter KASUMI block cipher which may comprise two rounds of the full KASUMI block cipher 14, such as the first two rounds of the full KASUMI block cipher 14.

[0118] Reference is now made again to FIG. 1. Feedback data for the partial KASUMI block cipher 12 may be modified by static data held in a buffer, such as but not limited to, a 64-bit register A (reference numeral 20), and a variable comprising an (incrementing) 64-bit counter BLKCNT (reference numeral 22). The keystream generator of FIG. 1 may be initialized with key variables before generating keystream bits. The key variables may comprise without limitation COUNT (e.g., a 32-bit time variant input), BEARER (e.g., a 5-bit input) and DIRECTION (e.g., a 1-bit input which may indicate the direction of transmission (uplink or downlink)), and a cipher key CK (e.g., a 128-bit confidentiality key) XORed with a key modifier KM (e.g., a 128-bit constant used to modify a key). For example, the partial KASUMI block cipher 12 may have an input from an XOR gate 16, which may XOR the cipher key CK with the output of an AND gate 18 which has ANDed KM with an Init bit. The COUNT, BEARER and DIRECTION inputs may be ANDed with an Init bit by an AND gate 24. An AND gate 26 may AND the output of the partial KASUMI block cipher 12 and Init+1. An OR gate 28 may OR the output of the AND gates 24 and 26, and output to register A. A gate 30 may perform a Boolean operation, such as for example an exclusive-OR (XOR) operation, on register A, BLKCNT and the output of the partial KASUMI block cipher 12.

[0119] In one non-limiting example of the invention, the 64-bit register A may be set to COUNT∥BEARER∥DIRECTION∥0 . . . 0 (left justified with the right most 26 bits set to 0).

[0120] For example, A may equal COUNT[0]. . . COUNT[31] BEARER[0]. . . BEARER[4] DIRECTION[0]0 . . . 0. Counter BLKCNT may be set to zero. Key modifier KM may be set to a constant 32-bit (hexadecimal) 5555 . . . 5h. The initial keystream block KSB₀ may be set to zero.

[0121] Once the keystream generator of FIG. 1 has been initialized, (e.g., to the exemplary values in the previous paragraph), the keystream generator may be used to generate keystream blocks (KSBs). One operation of the partial KASUMI block cipher 12 may be applied to the register A, using a modified version of the confidentiality key CK:

A=Partial−KASUMI[A] _(CK⊕KM)

[0122] The first result may be saved in register A, and subsequent results may be XORed with that value. To obtain the first result of the confidentiality function of FIG. 1, an XOR operation may be carried out by XOR gate 30 between register A, BLKCNT=0 and the result (of the partial KASUMI block cipher 12)=0. This result of XOR gate 30 may then be input into the partial KASUMI block cipher 12 to produce the first keystream block KSB₁ (in the described example, a 64-bit block) using the cipher key CK (XORed with KM and Init by XOR gate 16).

[0123] Subsequent keystream blocks may be calculated similarly, wherein BLKCNT may be increased by one for each block 1 to n (wherein n=number of blocks), and the result of the partial KASUMI block cipher 12 input into the XOR gate 30 may be taken from the previous keystream block KSB (KSB₁. . . KSB_(n)). The keystream generator may continue until BLKCNT reaches the LENGTH (the number of bits in the input bitstream), signifying the end of the user data block.

[0124] Reference is now made to FIG. 6, which illustrates using the partial KASUMI block cipher 12 for performing an integrity function, in accordance with an embodiment of the invention.

[0125] The integrity function may be initialized as follows:

[0126] A=0 and B=0, wherein A and B are 64-bit registers that may be used to hold intermediate values, and

[0127] a key modifier KM may be set to a constant 128-bit hexadecimal AAAAA . . . Ah.

[0128] Variables may be used in the integrity function, such as FRESH, winch may be a 32-bit random input, and MESSAGE, which may be the input bitstream of LENGTH bits to be processed by the integrity function.

[0129] The integrity function may proceed as follows:

[0130] The variables COUNT, FRESH, MESSAGE and DIRECTION may be concatenated. A single ‘1’ bit may be appended thereto, followed by between 0 and 63 ‘0’ bits, so that the total length of the resulting string PS (padded string) may be an integral multiple of 64 bits:

[0131] PS=COUNT[0]. . . COUNT[31] FRESH[0]. . . FRESH[31] MESSAGE[0]. . . MESSAGE[LENGTH-1] DIRECTION[0]1 0*

[0132] wherein 0* indicates between 0 and 63 ‘0’ bits.

[0133] The padded string PS may then be split into 64-bit blocks PS_(i) where:

PS=PS₀∥PS₁∥PS₂∥. . . ∥PS_(BLOCKS-1)

[0134] The following operations may be performed for each integer n with 0≦n≦BLOCKS-1:

A=Partial−KASUMI[A⊕PS _(n)]_(IK)

B=B⊕A

[0135] wherein IK may be a 128-bit integrity key.

[0136] Finally, one more application of the partial KASUMI may be carried out using a modified form of the integrity key IK.

B=Partial−KASUMI[B] _(IK⊕KM)

[0137] The integrity function may produce a 32-bit message authentication code (MAC-I). MAC-I may comprise the left-most 32 bits of the result:

MACH-I=lefthalf[B]

[0138] In other words, for each integer i with 0≦i≦31:

[0139] MAC-I[i]=B[i], wherein Bits B[32]. . . B[63] may be discarded.

[0140] Referring to FIG. 6, an embodiment of the invention may comprise without limitation an XOR gate 40, which may XOR tie output of the partial KASUMI block cipher 12 and the previous contents of register A, the XOR result being fed into register A with Init. The output of register A and BLKCNT may be ANDed by an AND gate 42. XOR gate 30 may XOR the output of AND gate 42 and an input message 44, the XOR result being fed into the partial KASUMI block cipher 12. KM and an end bit (flag) may be input to AND gate 18. The output of AND gate 18 may XORed with IK by XOR gate 16, whose output may be fed to the partial KASUMI block cipher 12.

[0141] When the Init bit is turned on, register A may be initially set to “0”, Km may be set to a constant 128-bit hexadecimal AAAAA . . . Ah, and the input message may be the abovementioned PS (padded string). The message may be fed block by block (e.g., 64 bits) to the partial KASUMI block cipher 12. XOR gate 30 may iteratively XOR the 64-bit block from gate 42 with the input message to register A (the previous result of the partial KASUMI block cipher 12). When BLKCNT reaches the LENGTH (the number of bits in the input bitstream), signifying the end of the data, the end flag may go up and another partial KASUMI operation may be performed on register A using IK⊕KM. The 32 most significant bits from the last partial KASUMI operation may be the MAC-I message.

[0142] Reference is now made to FIG. 7, which illustrates a general flow chart for performing the confidentiality algorithm f8 and the integrity algorithm f9 with the partial KASUMI block cipher 12, in accordance with an embodiment of the invention. As may be seen in FIG. 7, data (e.g., 64-bit input) may be input into the partial KASUMI block cipher 12. The partial KASUMI block cipher 12 may process (e.g., encrypt) the input data and generate an output (e.g., 64-bit output). For example, for performing the confidentiality algorithm f8, the partial KASUMI block cipher 12 may generate an output keystream, as described hereinabove, e.g., an output bitstream in multiples of 64-bits. For performing the integrity algorithm f9, the partial KASUMI block cipher 12 may generate a 64-bit digest of the message input, as described hereinabove, wherein the leftmost 32-bits of the digest are taken as the output value MAC-I (message authentication code). The output may be sent to an output buffer (e.g., register A).

[0143] The partial KASUMI block cipher 12 may process large amounts of user data in a continuous mode. In the continuous mode, the partial KASUMI block cipher 12 may not erase the previous user data, but rather use the previous data to generate and output the next set of data in a continuous loop until the user data may be finished. The continuous mode implemented with the partial KASUMI block cipher 12 may be used to perform the confidentiality algorithm f8 and the integrity algorithm f9 with a significantly fewer amount of gates than a full KASUMI block cipher. Optionally, the partial KASUMI block cipher may be used to generate some of the keystream and/or message authentication code as described hereinabove, and the full KASUMI block cipher may be used to generate the rest of the keystream and/or message authentication code.

[0144] The embodiment of FIG. 7 may comprise a program of instructions. The program storage device 21 of FIG. 1 may tangibly embody this program of instructions, readable and executable by a machine, such as processor 23.

[0145] While certain features of the invention have been illustrated and described herein, many modifications, substitutions, changes, and equivalents will now occur to those of ordinary skill in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the invention. 

What is claimed is:
 1. A method comprising: generating at least one of a keystream and a message authentication code with a partial KASUMI block cipher, without utilizing a full KASUMI block cipher.
 2. The method according to claim 1, further comprising performing a confidentiality algorithm comprising a keystream output from said partial KASUMI block cipher.
 3. The method according to claim 1, further comprising performing an integrity algorithm comprising a message authentication code output from said partial KASUMI block cipher.
 4. The method according to claim 1, wherein generating comprises modifying data output from said partial KASUMI block cipher and inputting the data that has been modified to said partial KASUMI block cipher.
 5. The method according to claim 4, further comprising outputting data from said partial KASUMI block cipher to a buffer, and wherein modifying comprises modifying the data in said buffer.
 6. The method according to claim 5, wherein modifying comprises performing a Boolean operation on data from said buffer, and inputting a result of said Boolean operation to said partial KASUMI block cipher.
 7. The method according to claim 5, wherein modifying comprises performing an exclusive-OR operation on data taken from said buffer and a counter, and inputting the result of said exclusive-OR operation to said partial KASUMI block cipher.
 8. The method according to claim 5, wherein modifying comprises performing an exclusive-OR operation on data taken from said buffer, a counter and an input message, and inputting the result of said exclusive-OR operation to said partial KASUMI block cipher.
 9. The method according to claim 1, further comprising inputting to said partial KASUMI block cipher a result of an exclusive-OR operation performed on a cipher key and a constant.
 10. The method according to claim 1, further comprising inputting to said partial KASUMI block cipher a result of an exclusive-OR operation performed on an integrity key and a constant.
 11. A method comprising: generating at least a portion of at least one of a keystream and a message authentication code with a partial KASUMI block cipher, and optionally utilizing a full KASUMI block cipher to generate another portion of at least one of the keystream and the message authentication code.
 12. The method according to claim 11, further comprising performing a confidentiality algorithm comprising a keystream output from said partial KASUMI block cipher.
 13. The method according to claim 11, further comprising performing an integrity algorithm comprising a message authentication code output from said partial KASUMI block cipher.
 14. Apparatus comprising: a circuit able to execute a partial KASUMI block cipher comprising a portion of a full KASUMI block cipher; and a buffer to output data thereto from said partial KASUMI block cipher.
 15. The apparatus according to claim 14, further comprising a processor able to perform a Boolean operation on data from said buffer and input a result of said Boolean operation to said partial KASUMI block cipher.
 16. The apparatus according to claim 15, wherein said processor comprises an exclusive-OR gate.
 17. The apparatus according to claim 14, further comprising a processor able to perform an exclusive-OR operation on a cipher key and a constant.
 18. The apparatus according to claim 14, further comprising a processor able to perform an exclusive-OR operation on an integrity key and a constant.
 19. An article comprising: a storage medium for storing instructions that enable a processor to perform at least one of a confidentiality algorithm and an integrity algorithm comprising an output from a partial KASUMI block cipher.
 20. The article according to claim 19, wherein said instructions comprise instructions to modify data output from said partial KASUMI block cipher and to input the data that has been modified to said partial KASUMI block cipher.
 21. A communications system comprising: a circuit able to execute a partial KASUMI block cipher comprising a portion of a full KASUMI block cipher, a buffer for outputting data thereto from said partial KASUMI block cipher, and a code division multiple access compliant transceiver able to communicate data between said partial KASUMI block cipher and a cellular telephone system.
 22. The system according to claim 21, further comprising an antenna suitable for CDMA communication between said code division multiple access compliant transceiver and the cellular telephone system. 